Intersection Method

Wintellect PowerCollections

previous page next page

[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]

Computes the intersection of this bag with another bag. The intersection of two bags is all items that appear in both of the bags. If an item appears X times in one bag, and Y times in the other bag, the sum contains the item Minimum(X,Y) times. A new bag is created with the intersection of the bags and is returned. This bag and the other bag are unchanged.

Namespace: Wintellect.PowerCollections
Assembly: PowerCollections (in PowerCollections.dll)

Syntax

C#
public OrderedBag<T> Intersection( OrderedBag<T> otherBag )

Visual Basic (Declaration)
Public Function Intersection ( _ otherBag As OrderedBag(Of T) _ ) As OrderedBag(Of T)

Visual C++
public: OrderedBag<T>^ Intersection ( OrderedBag<T>^ otherBag )

Parameters

otherBag: OrderedBag<(Of <T>)>
Bag to intersection with.

Return Value

The intersection of the two bags.

Remarks

When equal items appear in both bags, the intersection will include an arbitrary choice of one of the two equal items.

The intersection of two bags is computed in time O(N log M), where M is the size of the larger bag, and N is the size of the smaller bag.

Exceptions

Exception	Condition
System..::InvalidOperationException	This bag and otherBag don't use the same method for comparing items.
System..::ArgumentNullException	otherBag is null.